Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization
نویسندگان
چکیده
In this paper, a simulated-annealing-based method called Filter Simulated Annealing (FSA) method is proposed to deal with the constrained global optimization problem. The considered problem is reformulated so as to take the form of optimizing two functions, the objective function and the constraint violation function. Then, the FSA method is applied to solve the reformulated problem. The FSA method invokes a multi-start diversification scheme in order to achieve an efficient exploration process. To deal with the considered problem, a filter-set-based procedure is built in the FSA structure. Finally, an intensification scheme is applied as a final stage of the proposed method in order to overcome the slow convergence of SA-based methods. The computational results obtained by the FSA method are promising and show a superior performance of the proposed method, which is a point-to-point method, against population-based methods.
منابع مشابه
Optimization using Function Values Only
In this paper, we focus on solving global optimization problems using only the values of the objective function. In particular we explore the Simulated Annealing method, and find improvements using techniques in Derivative Free Optimization methods. The first part of the paper examines the well known Simulated Annealing algorithm. We discuss important theoretical results, and we then demonstrat...
متن کاملQMF filter bank design by a new global optimization method
In this paper, we study various global optimization methods for designing QMF (quadrature mirror lter) lter banks. We formulate the design problem as a nonlinear constrained optimization problem, using the reconstruction error as the objective, and other performance metrics as constraints. This formulation allows us to search for designs that improve over the best existing designs. We present N...
متن کاملConstrained Simulated Annealing with Applications in Nonlinear Continuous Constrained Global Optimization
This paper improves constrained simulated annealing (CSA), a discrete global minimization algorithm with asymptotic convergence to discrete constrained global minima with probability one. The algorithm is based on the necessary and suucient conditions for discrete constrained local minima in the theory of discrete La-grange multipliers. We extend CSA to solve nonlinear continuous constrained op...
متن کاملGlobal Optimization Method for Design Problems
Article history: Received: 13.2.2015. Received in revised form: 24.3.2015. Accepted: 27.3.2015. In structural design optimization method, numerical techniques are increasingly used. In typical structural optimization problems there may be many locally minimum configurations. For that reason, the application of a global method, which may escape from the locally minimum points, remains essential....
متن کاملSequential Monte Carlo simulated annealing
In this paper, we propose a population-based optimization algorithm, Sequential Monte Carlo Simulated Annealing (SMC-SA), for continuous global optimization. SMC-SA incorporates the sequential Monte Carlo method to track the converging sequence of Boltzmann distributions in simulated annealing. We prove an upper bound on the difference between the empirical distribution yielded by SMC-SA and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 35 شماره
صفحات -
تاریخ انتشار 2006